Permutation groups and set union algorithms
نویسندگان
چکیده
منابع مشابه
Some Algorithms for Nilpotent Permutation Groups
(Received) Let G, H and E be subgroups of a nite nilpotent permutation group of degree n. We describe the theory and implementation of an algorithm to compute the normalizer N G (H) in time polynomial in n, and we give a modiied algorithm to determine whether H and E are conjugate under G and, if so, to nd a conjugating element of G. Other algorithms produce the intersection G \ H and the centr...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملPermutation Groups
The theory of permutation groups is essentially the theory of symmetry for mathematical and physical systems. It therefore has major impact in diverse areas of mathematics. Twentieth-century permutation group theory focused on the theory of finite primitive permutation groups, and this theory continues to become deeper and more powerful as applications of the finite simple group classification,...
متن کاملAlgorithms for a class of infinite permutation groups
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m). This article describes a collection of algorithms and methods for computation in permutation groups and monoids formed by residue-class-wise affine mappings.
متن کاملPartitions and Permutation Groups
We show that non-trivial extremely amenable topological groups are essentially the same thing as permutation models of the Boolean prime ideal theorem that do not satisfy the axiom of choice. Both are described in terms of partition properties of group actions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1980
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/23.2.187-a